离散小波变换-遗传算法-交互检验法用于近红外光谱数据的高倍压缩与变量筛选

用遗传算法(GA)与交互检验(CV)相结合建立了一种用于对近红外光谱(NIR)数据及其离散小波变换(DWT)系数进行变量筛选的方法，并应用于烟草样品中总挥发碱和总氮的同时测定。结果表明：NIR数据经DWT压缩为原始大小的3．3％时基本没有光谱信息的丢失；有效的变量筛选可以极大地减少模型中的变量个数，降低模型的复杂程度，改善预测的准确度。     

Cavitands bearing four fluorophores

The synthesis of novel cavitands containing four fluorophores [tert-butoxycarbonyl protected 2,2′-bis(furyl)benzidine (t-BOC FurylBz) or 5,5′-bis(4-aminophenyl)-2,2′-bifuryl (t-BOC PFDA)] and ionophoric functional groups on the upper rim is reported. The cavitands bearing the four fluorophores emit blue light photoluminescence. In particular, the cavitand containing PFDA moieties exhibits a high photoluminescence quantum yield.     

Synthetic,spectroscopic, and structural Studies on Lanthanide Complexes of Diphosphazane Dioxide Ligands

Lanthanide nitrate complexes of diphosphazane dioxides Ph₂P(O)N(Prⁱ)P(O)Ph₂ ( 1 ) and (PhO)₂P(O)N(Me)P(O)(OPh)₂ ( 2 ) have been synthesised and studied by conductometry, IR, multinuclear NMR spectroscopic methods and X-ray diffraction. Ligand 2 is accessible by two different methods, viz., by direct oxidation of the phosp(III)azane ligand or by starting from phosph(V)azane chloro precursor. The structure of 2 is confirmed by X-ray diffraction. Crystallographic data for 2 : Triclinic, Space group P1 , a = 10.078(1), b = 10.575(3), c = 12.364(4) Å, α = 75.70(2)°, α = 75.56(1)°, γ = 77.68(1)°, Z = 2, V = 1 220 ų; structure refined to R_F = 0.0459 on 3 495 data with F > 3σ(F). The diphosphazane dioxide ligand exhibits trans geometry in the solid state. The structure of a lanthanide complex, [Pr(NO₃)₃( 2 )₂] ( 14 ) is also determined by X-ray diffraction. Crystallographic data for 14 : Trigonal, Space group P3₂, a = b = 15.710(2), c = 40.067(2) Å, Z = 6, V = 8 564 ų; structure refined to R_F = 0.0430 on 8 077 data with F > 5σ(F). The two diphosphazane dioxide ligands and the nitrate groups are coordinated to praseodymium in a bidentate chelate fashion. The geometry around the ten coordinated metal is distorted bicapped square antiprism.     

Preliminary study on dual fluorescence behavior of porphyrin

It is well known that porphyrin derivatives play a key role in the primary process of photo-synthesis[1], in which porphyrins directly absorb the sunlight or indirectly acquire excitation en-ergy from light-harvesting antenna system to reach their excited state, and then donate electrons to quinone acceptors to yield a series of charge-separated species. In general, only first singlet ex-cited state of porphyrins is involved in energy transfer process[2]. However, highly excited state (S2 stat…     

Solid Phase Extraction and Simultaneous Spectrophotometric Determination of Trace Amounts of Copper and Iron Using Mixture of Ligands

 A novel sensitive and simple method for rapid and selective extraction, preconcentration and determination of iron (as its bathophenanthroline complex) and copper (as its neocuproine complex) using octadecyl silica cartridges and dual wavelength spectrophotometry is presented. The dual wavelength method (533 nm for the iron-bathophenanthroline and 454 nm for the copper-neocuproine as the analytical wavelength) is used to eliminate spectral interferences. Extraction efficiency and the influence of flow rates of sample solution and eluent, pH, amount of neocuproine, bathophenanthroline and hydroxylamine hydrochloride, type and least amount of eluent for elution of iron and copper complexes from cartridge, break-through volume and limit of detection are evaluated. The effects of various cationic and anionic interferences on percent recovery of iron and copper are also studied. Extraction efficiencies >95% are obtained by elution of cartridges with minimal amount of organic solvent. Iron and copper were determined in the range of 3–100 ng mL⁻¹. The limits of detection are 0.98 and 1.13 ng mL⁻¹ for iron and copper, respectively. The proposed method is applied successfully to the determination of both analytes in river, tap and well water samples. Author for correspondence. E-mail: yyamini@modares.ac.ir Received September 18, 2002; accepted December 12, 2002 Published online May 5, 2003     

A quadratically convergent O(\sqrt n L)-iteration algorithm for linear programming

Recently, Ye, Tapia and Zhang (1991) demonstrated that Mizuno—Todd—Ye's predictor—corrector interior-point algorithm for linear programming maintains the O( L)-iteration complexity while exhibiting superlinear convergence of the duality gap to zero under the assumption that the iteration sequence converges, and quadratic convergence of the duality gap to zero under the assumption of nondegeneracy. In this paper we establish the quadratic convergence result without any assumption concerning the convergence of the iteration sequence or nondegeneracy. This surprising result, to our knowledge, is the first instance of a demonstration of polynomiality and superlinear (or quadratic) convergence for an interior-point algorithm which does not assume the convergence of the iteration sequence or nondegeneracy.Supported in part by NSF Grant DDM-8922636 and NSF Coop. Agr. No. CCR-8809615, the Iowa Business School Summer Grant, and the Interdisciplinary Research Grant of the University of Iowa Center for Advanced Studies.Supported in part by NSF Coop. Agr. No. CCR-8809615, AFOSR 89-0363, DOE DEFG05-86ER25017 and ARO 9DAAL03-90-G-0093.Supported in part by NSF Grant DMS-9102761 and DOE Grant DE-FG05-91ER25100.     

Bonferroni-type inequalities; Chebyshev-type inequalities for the distributions on [0, n]

An elementary majorant-minorant method to construct the most stringent Bonferroni-type inequalities is presented. These are essentially Chebyshev-type inequalities for discrete probability distributions on the set {0, 1,..., n}, where n is the number of concerned events, and polynomials with specific properties on the set lead to the inequalities. All the known results are proved easily by this method. Further, the inequalities in terms of all the lower moments are completely solved by the method. As examples, the most stringent new inequalities of degrees three and four are obtained. Simpler expressions of Mrgritescu's inequality (1987, Stud. Cerc. Mat., 39, 246–251), improving Galambos' inequality, are given.     

Comparative analysis of affine scaling algorithms based on simplifying assumptions

We analyze several affine potential reduction algorithms for linear programming based on simplifying assumptions. We show that, under a strong probabilistic assumption regarding the distribution of the data in an iteration, the decrease in the primal potential function will be with high probability, compared to the guaranteed(1). ( 2n is a parameter in the potential function andn is the number of variables.) Under the same assumption, we further show that the objective reduction rate of Dikin's affine scaling algorithm is with high probability, compared to no guaranteed convergence rate.Research supported in part by NSF Grant DDM-8922636.     

Chains of strongly non-reflexive dual groups of integer-valued continuous functions

Answering a question of Eklof-Mekler (Almost free modules, set-theoretic methods, North-Holland, Amsterdam, 1990), we prove: (1) If there exists a non-reflecting stationary set of consisting of ordinals of cofinality for each , then there exist abelian groups such that and for each . (2) There exist abelian groups such that for each and for each . The groups are the groups of -valued continuous functions on a topological space and their dual groups.

     

Strict inequalities for the derivatives of functions satisfying certain boundary conditions

For functions satisfying the boundary conditions